Benchmarking Holistic Approaches to XML Tree Pattern Query Processing - (Extended Abstract of Invited Talk)

نویسنده

  • Jiaheng Lu
چکیده

In this talk I will outline and survey some developments in the field of XML tree pattern query processing, especially focussing on holistic approaches. XML tree pattern query (TPQ) processing is a research stream within XML data management that focuses on efficient TPQ answering. With the increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conforms to a tree-structured data model. Queries on XML data are commonly expressed in the form of tree patterns (or twig patterns), which represent a very useful subset of XPath and XQuery. Efficiently finding all tree pattern matches in an XML database is a major concern of XML query processing. In the past few years, many algorithms have been proposed to match such tree patterns. In the talk, I will present an overview of the state of the art in TPQ processing. This overview shall start by providing some background in holistic approaches to process TPQ and then introduce different algorithms and finally present benchmark datasets and experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Algorithm for XML Tree Pattern Matching and Pattern Tree Minimization

IJPRES Abstract— The extensible markup language XML has recently to come into read as a new standard for data representation and exchange on the internet. With XML becoming present language for data ability functions in varied domains, efficiently querying XML data is a critical issue. XML has become a follow normal to store, share and exchange business data across similar and dissimilar platfo...

متن کامل

Indexing and querying XML using extended Dewey labeling scheme

Article history: Received 18 May 2009 Received in revised form 1 August 2010 Accepted 3 August 2010 Available online xxxx Finding all the occurrences of a tree pattern in an XML database is a core operation for efficient evaluation of XML queries. The Dewey labeling scheme is commonly used to label an XML document to facilitate XML query processing by recording information on the path of an ele...

متن کامل

Twig Pattern Matching Algorithms for XML

The emergence of XML promised significant advances in B2B integration. This is because users can store or transmit structure data using this highly flexible open standard. An effective well-formed XML document structure helps convert data into useful information that can be processed quickly and efficiently. From this point there is need for efficient processing of queries on XML data in XML da...

متن کامل

An Accurate Identification of Extended XML Tree Pattern for XQuery Language

In order to utilize high-performance XML tree pattern query (TPQ) for implementing of XQuery language effectively, it is necessary to analysis the query plan and identify tree pattern from it. In this paper, we extend the functional intermediate language FXQL, which is used to implement XQuery language, with an extended XML generalized tree pattern representation (GTP++). Then, we propose an XM...

متن کامل

Demythization of XML Query Processing: Technical Report

XML queries can be modeled by twig pattern queries (TPQs) specifying predicates on XML nodes and XPath relationships satisfied between them. A lot of TPQ types have been proposed; this paper takes into account a TPQ model extended by a specification of output and non-output query nodes since it complies with the XQuery semantics and, in many cases, it leads to a more efficient query processing....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010